PEGGING MITOCHONDRIAL POSITION

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pegging Mitochondrial Position

JCB • VOLUME 182 • NUMBER 1 • 2008 2 ATHEROSCLEROSIS NEEDS SHC Liu et al. fi nd that an adaptor protein called Shc orchestrates the response of endothelial cells to stress caused by turbulent blood fl ow. In endothelial cells, alterations in blood fl ow are sensed by cell–cell junctions and cell–matrix adhesions, which can trigger infl ammation and the formation of atherosclerotic plaques. The ...

متن کامل

Graph pegging numbers

In graph pegging, we view each vertex of a graph as a hole into which a peg can be placed, with checker-like “pegging moves” allowed. Motivated by well-studied questions in graph pebbling, we introduce two pegging quantities. The pegging number (respectively, the optimal pegging number) of a graph is the minimum number of pegs such that for every (respectively, some) distribution of that many p...

متن کامل

Exchange - Rate Pegging in Emerging - Market Countries ?

This paper examines the question of whether pegging exchange rates is a good strategy for emergingmarket countries. Although pegging the exchange rate provides a nominal anchor for emerging market countries that can help them to control inflation, the analysis in this paper does not provide support for this strategy for the conduct of monetary policy. First there are the usual criticisms of exc...

متن کامل

Pegging Numbers For Various Tree Graphs

In the game of pegging, each vertex of a graph is considered a hole into which a peg can be placed. A pegging move is performed by jumping one peg over another peg, and then removing the peg that has been jumped over from the graph. We define the pegging number as the smallest number of pegs needed to reach all the vertices in a graph no matter what the distribution. Similarly, the optimal-pegg...

متن کامل

Lagrangian relaxation and pegging test for the clique partitioning problem

The clique partitioning problem is an NP-hard combinatorial optimization problem with applications to data analysis such as clustering. Though a binary integer linear programming formulation has been known for years, one needs to deal with a huge number of variables and constraints when solving a large instance. In this paper, we propose a size reduction algorithm which is based on the Lagrangi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Cell Biology

سال: 2008

ISSN: 1540-8140,0021-9525

DOI: 10.1083/jcb.1821iti3